JMLR: Workshop and Conference Proceedings vol 40:1–17, 2015 Label optimal regret bounds for online local learning Pranjal Awasthi∗ PAWASHTI @ CS . PRINCETON . EDU

Source URL: jmlr.org

• NP-complete problems
• Analysis of algorithms
• Clique problem
• Planted clique
• Time complexity
• Clique
• Matching
• Big O notation
• Matching polynomial
• Graph coloring

Caching Algorithms and Rational Models of Memory Avi Press () Michael Pacer () Thomas L. Griffiths (tom ) Department of Psychology, University of California,

Source URL: cocosci.berkeley.edu

• Virtual memory
• Online algorithms
• Cache
• Cache algorithms
• Cognitive biases
• Page replacement algorithm
• Least frequently used
• Short-term memory
• Spacing effect
• Storage
• Adaptive replacement cache
• Recall

Online Evolution in Unreal Tournament 2004 Matthew Patrick, Student Member, IEEE Abstract— Traditional approaches to game AI often feature behaviour that is scripted and predictable. Previous attempts at adaptive AI ha

Source URL: game.itu.dk

• Evolutionary algorithms
• Evolution
• Cybernetics
• Mathematical optimization
• Scientific modeling
• Genetic algorithm
• Evolutionary computation
• Fitness landscape
• Evolution strategy
• Multi-agent system
• Agent-based model
• Reinforcement learning

Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM Christopher Fletcher MIT

Source URL: eprint.iacr.org

• Computing
• Analysis of algorithms
• Cache
• Models of computation
• Oblivious ram
• Oram
• Hash table
• Internet Relay Chat
• Sorting algorithm

Theoretical Computer Science–16 www.elsevier.com/locate/tcs A new lower bound for the list update problem in the partial cost model

Source URL: www.maths.lse.ac.uk

• Online algorithms
• Analysis of algorithms
• List update problem
• Competitive analysis
• Adversary model
• Algorithm
• K-server problem

Friend Grouping Algorithms for Online Social Networks: preference, bias, and implications Motahhare Eslami, Amirhossein Aleyasen, Roshanak Zilouchian Moghaddam, and Karrie Karahalios University of Illinois at Urbana-Cham

Source URL: social.cs.uiuc.edu

• Software
• Computing
• Geostatistics
• Cluster analysis
• Data mining
• Social networking services
• Hierarchical clustering
• Facebook
• Recommender system

Online Evolution for Multi-Action Adversarial Games Niels Justesen1 , Tobias Mahlmann2 , and Julian Togelius3 1 2 IT University of Copenhagen

Source URL: julian.togelius.com

• Mathematics
• Game artificial intelligence
• Search algorithms
• Applied mathematics
• Combinatorial game theory
• Minimax
• Monte Carlo tree search
• Negamax
• Monte Carlo method
• Heuristic
• Greedy algorithm
• A* search algorithm

Online Passive-Aggressive Algorithms for Non-Negative Matrix Factorization and Completion Supplementary material A Proof of Lemma 1

Source URL: www.mblondel.org

Online Passive-Aggressive Algorithms for Non-Negative Matrix Factorization and Completion Mathieu Blondel Yotaro Kubo Naonori Ueda

Source URL: www.mblondel.org

Journal of Algorithms 38, 237᎐259 Ž2001. doi:10.1006rjagm, available online at http:rrwww.idealibrary.com on Constructing Optimal Trees from Quartets David Bryant C.R.M., Uni¨ ersite´ de Montreal,

Source URL: www.maths.otago.ac.nz